An Exact Algorithm for Higher-Dimensional Orthogonal Packing
نویسندگان
چکیده
منابع مشابه
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational re...
متن کاملAn Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
This paper describes a branch-and-cut algorithm for solving a two-dimensional orthogonal packing problem with unloading constraints, which often occurs as a subproblem of mixed vehicle routing and loading problems. At each node of the branching tree, cuts are generated to find a feasible integer solution to a one-dimensional contiguous bin packing problem. If an integer solution is obtained, an...
متن کاملLower-dimensional Relaxations of Higher-dimensional Orthogonal Packing
Consider the feasibility problem in higher-dimensional orthogonal packing. Given a set I of d-dimensional rectangles, we need to decide whether a feasible packing in a d-dimensional rectangular container is possible. No item rotation is allowed and item edges are parallel to the coordinate axes. Typically, solution methods employ some bounds to facilitate the decision. Various bounds are known,...
متن کاملA Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for instances in twoor higher-dimensional space. We present a new approach for modeling packings, using a graph-theoretical characterization of feasible packings. Ou...
متن کاملLower-Dimensional Bounds and a New Model for Higher-Dimensional Orthogonal Packing
Consider the feasibility problem in higher-dimensional orthogonal packing. Given a set I of d-dimensional rectangles, we need to decide whether a feasible packing in a d-dimensional rectangular container is possible. No item rotation is allowed and item edges are parallel to the coordinate axes. Typically, solution methods employ some bounds to facilitate the decision. Various bounds are known,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2007
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1060.0369